A linear-time algorithm for broadcast domination in a tree
نویسندگان
چکیده
منابع مشابه
A linear-time algorithm for broadcast domination in a tree
The broadcast domination problem is a variant of the classical minimum dominating set problem in which a transmitter of power p at vertex v is capable of dominating (broadcasting to) all vertices within distance p from v. Our goal is to assign a broadcast power f(v) to every vertex v in a graph such that ∑ v∈V f(v) is minimized, and such that every vertex u with f(u) = 0 is within distance f(v)...
متن کاملA Linear-time Algorithm for Broadcast Domination Problem on Interval Graphs
The broadcast domination problem of a graph G = (V,E) is to find a subset B ⊆ V such that the vertices in V \B can be dominated by some vertex in B. The difference between broadcast domination and classical domination is that each vertex v in B is assigned a power value f(v) where f(v) ≥ 1 and the vertices in distance at most f(v) to v can hear (be dominated by) v. The goal is to find the minim...
متن کاملA Linear Time Algorithm for Tree Mapping
Inconsistencies between a phylogenetic tree calculated from a set of related genes and known species phylogeny may be due to duplications events in the gene family under study. Tree Mapping attempts to pinpoint gene duplications in order to explain such discrepancies. The e ort in this explanation is measured using a tree mapping measure. Very little algorithmic work has so far been invested in...
متن کاملA linear-time algorithm for connected r-domination and Steiner tree on distance-hereditary graphs
A distance-hereditary graph is a connected graph in which every induced path is isometric, i.e., the distance of any two vertices in an induced path equals their distance in the graph. We present a linear time labeling algorithm for the minimum cardinality connected r-dominating set and Steiner tree problems on distance-hereditary graphs. q 1998 John Wiley & Sons, Inc. Networks 31: 177–182, 1998
متن کاملBroadcast Domination on Block Graphs in Linear Time
A broadcast domination on a graph assigns an integer value f(u) ≥ 0 to each vertex u, such that every vertex u with f(u) = 0 is within distance f(v) from a vertex v with f(v) > 0. The Broadcast Domination problem seeks to compute a broadcast domination where the sum of the assigned values is minimized. We show that Broadcast Domination can be solved in linear time on block graphs. For general g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2008
ISSN: 0028-3045
DOI: 10.1002/net.20275